An Explicit Solution for the Value Function of a Priority Queue
نویسندگان
چکیده
We consider a multiclass preemptive-resume priority queue with Poisson arrivals and general service times. We derive explicit expressions for the discounted expected and long-run average weighted queue lengths and switching costs, the latter one only in the case of exponential service times. We illustrate our results with numerical calculations.
منابع مشابه
Transient Solution of an M/M/1 Variant Working Vacation Queue with Balking
This paper presents the transient solution of a variant working vacation queue with balking. Customers arrive according to a Poisson process and decide to join the queue with probability $b$ or balk with $bar{b} = 1-b$. As soon as the system becomes empty, the server takes working vacation. The service times during regular busy period and working vacation period, and vacation times are assumed ...
متن کاملOn Finite Queue with Two Types of Failures and Preemptive Priority (RESEARCH NOTE)
We study the single server queueing system with two types of Abstract failure to servicechannels including the preemptive priority to the repair of major failure. The units arrive at thesystem in a poisson fashion and are served exponenitally. The steady - state probabilities ofvarious states by using generating function have been obtained.
متن کاملRemarks on the O(N) Implementation of the Fast Marching Method
The fast marching algorithm computes an approximate solution to the eikonal equation in O(N logN) time, where the factor logN is due to the administration of a priority queue. Recently, [YBS06] have suggested to use an untidy priority queue, reducing the overall complexity to O(N) at the price of a small error in the computed solution. In this paper, we give an explicit estimate of the error in...
متن کاملImplementation of the Fast Marching Method
The fast marching algorithm computes an approximate solution to the eikonal equation in O(N logN) time, where the factor logN is due to the administration of a priority queue. Recently, [YBS06] have suggested to use an untidy priority queue, reducing the overall complexity to O(N) at the price of a small error in the computed solution. In this paper, we give an explicit estimate of the error in...
متن کاملA Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 47 شماره
صفحات -
تاریخ انتشار 2004